Forbidden induced bipartite graphs
نویسندگان
چکیده
منابع مشابه
Forbidden induced bipartite graphs
Given a fixed bipartite graph H, we study the asymptotic speed of growth of the number of bipartite graphs on n vertices which do not contain an induced copy of H. Whenever H contains either a cycle or the bipartite complement of a cycle, the speed of growth is 2Ω(n 6 5 ). For every other bipartite graph except the path on seven vertices, we are able to find both upper and lower bounds of the f...
متن کاملEfficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
Alon et. al. [3], showed that every property that is characterized by a finite collection of forbidden induced subgraphs is -testable. However, the complexity of the test is double-tower with respect to 1/ , as the only tool known to construct such tests uses a variant of Szemerédi’s Regularity Lemma. Here we show that any property of bipartite graphs that is characterized by a finite collectio...
متن کاملForbidden subgraph characterization of bipartite unit probe interval graphs
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes with an interval assigned to each vertex so that vertices are adjacent if and only if their corresponding intervals intersect and at least one of the vertices is a probe. When all intervals have the same length (or equivalently, no interval contains another properly) the graph is a unit probe in...
متن کاملInduced matchings in bipartite graphs
All graphs in this paper are understood to be finite, undirected, without loops or multiple edges. The graph G' = (V', E') is called an induced subgraph of G = (V, E) if V' ~ V and uv E E' if and only if {u, v} ~ V', uv E E. The following two problems about induced matchings have been formulated by Erdos and Nesetril at a seminar in Prague at the end of 1985: 1. Determine f(k, d), the maximum n...
متن کاملCharacterizing path graphs by forbidden induced subgraphs
A path graph is the intersection graph of subpaths of a tree. In 1970, Renz asked for a characterization of path graphs by forbidden induced subgraphs. We answer this question by determining the complete list of graphs that are not path graphs and are minimal with this property. 2009 Wiley Periodicals, Inc. J Graph Theory 62: 369–384, 2009
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2009
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.20355